When are Two Algorithms the Same?
نویسندگان
چکیده
منابع مشابه
When are two algorithms the same?
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
متن کاملWhen are two Workflows the Same?
In the area of workflow management, one is confronted with a large number of competing languages and the relations between them (e.g. relative expressiveness) are usually not clear. Moreover, even within the same language it is generally possible to express the same workflow in different ways, a feature known as variability. This paper aims at providing some of the formal groundwork for studyin...
متن کامل1 When are Two Games the Same ?
1 Logic and games: historical encounters Logic and games have had several encounters in history. One major factor in the emergence of logic in Antiquity was a systematic interest in the rules of argumentation, which have a clear game-like structure. Games were mathematized for the first time, one might say, in the17th century: when Pascal and Huygens based their idea of probability on betting o...
متن کاملWhen Are Two Protocols the Same?
A number of protocols based on the formal dialogue games of philosophy have recently been proposed for interactions between autonomous agents. Several of these proposals purport to assist agents engaged in the same types of interactions, such as persuasions and negotiations, and are superficially different. How are we to determine whether or not these proposals are substantially different? This...
متن کاملWhen Are Two Arguments the Same? Invariance in Abstract Argumentation∗
The paper proposes the use of modal logic methods for the development of suitable notions of invariance for abstract argumentation. In particular, it investigates the use of bisimulation and quasi-injective bisimulation as adequate forms of invariance for the argumentation-theoretic notions of grounded extension and of credulous admissibility.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2009
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1243948484